The quest for auditory direct manipulation: The sonified Towers of Hanoi
نویسندگان
چکیده
This paper presents a study of an auditory version of the game Towers of Hanoi. The goal of this study was to investigate the nature of continuos presentation and what this could mean when implementing auditory direct manipulation. We also wanted to find out if it was possible to make an auditory interface that met the requirements of a direct manipulation interface. The results showed that it was indeed possible to implement auditory direct manipulation, but using Towers of Hanoi as the underlying model restricted the possibilities of scaling the auditory space. The results also showed that having a limited set of objects, the nature of continuos presentation was not as important as how to interact with the auditory space.
منابع مشابه
Qualitative Aspects of Auditory Direct Manipulation: A Case Study of the Towers of Hanoi
This paper presents the results from a qualitative case study of an auditory version of the game Towers of Hanoi. The goal of this study was to explore qualitative aspects of auditory direct manipulation and the subjective experience from playing the game. The results show that it is important to provide a way of focusing in the auditory space. Articulatory directness was also an important issu...
متن کاملAuditory Direct Manipulation for Blind Computer Users
The use of computers today almost always requires that the user is able to see what is presented on the screen, a requirement that blind computer users are not able to fulfill. Many features of the graphical user interface are inaccessible for blind computer users; direct manipulation is one of them. Direct manipulation is a fundamental property of graphical user interfaces which makes the inte...
متن کاملSchreier Spectrum of the Hanoi Towers Group on Three Pegs
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action o...
متن کاملModified Hanoi Towers Groups and Limit Spaces
We introduce the k-peg Hanoi automorphisms and Hanoi self-similar groups, a generalization of the Hanoi Towers groups, and give conditions for them to be contractive. We analyze the limit spaces of a particular family of contracting Hanoi groups, H (k) c , and show that these are the unique maximal contracting Hanoi groups under a suitable symmetry condition. Finally, we provide partial results...
متن کاملOn the Solution of the Towers of Hanoi Problem
In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated. Keywords—Loopless algorithm, Binary tree, Towers of Hanoi.
متن کامل